Two - Level Schwarz Algorithms , Using Overlapping Subregions , for Mortar Finite Element

نویسندگان

  • HYEA HYUN KIM
  • OLOF B. WIDLUND
چکیده

Abstract. Preconditioned conjugate gradient methods based on two-level overlapping Schwarz methods often perform quite well. Such a preconditioner combines a coarse space solver with local components which are defined in terms of subregions which form an overlapping covering of the region on which the elliptic problem is defined. Precise bounds on the rate of convergence of such iterative methods have previously been obtained in the case of conforming lower order and spectral finite elements as well as in a number of other cases. In this paper, this domain decomposition algorithm and analysis are extended to mortar finite elements. It is established that the condition number of the relevant iteration operator is independent of the number of subregions and varies with the relative overlap between neighboring subregions linearly as in the conforming cases previously considered.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-Level Schwarz Algorithms with Overlapping Subregions for Mortar Finite Elements

Preconditioned conjugate gradient methods based on two-level overlapping Schwarz methods often perform quite well. Such a preconditioner combines a coarse space solver with local components which are defined in terms of subregions which form an overlapping covering of the region on which the elliptic problem is defined. Precise bounds on the rate of convergence of such iterative methods have pr...

متن کامل

Overlapping Nonmatching Grid Mortar Element Methods for Elliptic Problems

In the first part of the paper, we introduce an overlapping mortar finite element method for solving two-dimensional elliptic problems discretized on overlapping nonmatching grids. We prove an optimal error bound and estimate the condition numbers of certain overlapping Schwarz preconditioned systems for the two-subdomain case. We show that the error bound is independent of the size of the over...

متن کامل

A Numerical Study of FETI Algorithms for Mortar Finite Element Methods

The Finite Element Tearing and Interconnecting (FETI) method is an iterative substructuring method using Lagrange multipliers to enforce the continuity of the nite element solution across the subdomain interface. Mortar nite elements are nonconforming nite elements that allow for a geometrically nonconforming decomposition of the computational domain into subregions and, at the same time, for t...

متن کامل

Neumann–neumann Algorithms for a Mortar Crouzeix–raviart Element for 2nd Order Elliptic Problems

The paper proposes two scalable variants of the Neumann–Neumann algorithm for the lowest order Crouzeix–Raviart finite element or the nonconforming P1 finite element on nonmatching meshes. The overall discretization is done using a mortar technique which is based on the application of an approximate matching condition for the discrete functions, requiring function values only at the mesh interf...

متن کامل

A mortar element method for elliptic problems with discontinuous coefficients

This paper proposes a mortar finite element method for solving the two-dimensional second-order elliptic problem with jumps in coefficients across the interface between two subregions. Non-matching finite element grids are allowed on the interface, so independent triangulations can be used in different subregions. Explicitly realizable mortar conditions are introduced to couple the individual d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005